منابع مشابه
Strict Bounds for Pattern Avoidance
Cassaigne conjectured in 1994 that any pattern with m distinct variables of length at least 3(2m−1) is avoidable over a binary alphabet, and any pattern with m distinct variables of length at least 2 is avoidable over a ternary alphabet. Building upon the work of Rampersad and the power series techniques of Bell and Goh, we obtain both of these suggested strict bounds. Similar bounds are also o...
متن کاملStrict Lower Bounds for Model Checking BPA
We show strict lower bounds for the complexity of several model checking problems for BPA and branching-time logics. Model checking with Hennessy-Milner Logic PSPACE-hard, while model checking with the modal-calculus is EXPTIME-hard. By combining these results with already established upper bounds it follows that the model checking problems are PSPACE-complete and EXPTIME-complete, respectively.
متن کاملPattern Avoidance
Consider a sequence of letters or numbers. Does a pattern exist that is avoided by the sequence? This topic is a very popular area of research in mathematics for its promising utility in computer science and other branches of mathematics, the elegant proofs and solutions, and the many open problems that still remain. Section 1 of this paper provides definitions, notations, and some properties o...
متن کاملNew Equivalences for Pattern Avoidance for Involutions
We complete the Wilf classification of signed patterns of length 5 for both signed permutations and signed involutions. New general equivalences of patterns are given which prove Jaggard’s conjectures concerning involutions in the symmetric group avoiding certain patterns of length 5 and 6. In this way, we also complete the Wilf classification of S5, S6, and S7 for both permutations and involut...
متن کاملPattern avoidance with involution
We give the avoidance indices for all unary patterns with involution.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.08.010